The semi-convergence of GSI method for singular saddle point problems
نویسنده
چکیده
Recently, Miao and Wang considered the GSI method for solving nonsingular saddle point problems and studied the convergence of the GSI method. In this paper, we prove the semi-convergence of the GSI method when it is applied to solve the singular saddle point problems.
منابع مشابه
Semi-convergence of the Generalized Local Hss Method for Singular Saddle Point Problems
Recently, Zhu [Appl. Math. Comput., 218 (2012), 8816–8824] considered the generalized local HSS (GLHSS) method for solving nonsingular saddle point problems and studied its convergence. In this paper, we prove the semi-convergence of the GLHSS method when it is applied to solve the singular saddle point problems.
متن کاملSemi-convergence Analysis of the Inexact Uzawa Method for Singular Saddle Point Problems
Recently, various Uzawa methods were proposed based on different matrix splitting for solving nonsingular saddle point problems, and the necessary and sufficient condition of the convergence for those Uzawa methods were derived. Motivated by their results, in this paper we give the semi-convergence analysis of the inexact Uzawa method which is applied to solve singular saddle point problems und...
متن کاملSemi-convergence of an Alternating-direction Iterative Method for Singular Saddle Point Problems
For large-scale sparse saddle point problems, Peng and Li [12] have recently proposed a new alternating-direction iterative method for solving nonsingular saddle point problems, which is more competitive (in terms of iteration steps and CPU time) than some classical iterative methods such as Uzawa-type and HSS (Hermitian skew splitting) methods. In this paper, we further study this method when ...
متن کاملPerformance Analysis of a Special GPIU Method for Singular Saddle Point Problems
In this paper, we first provide semi-convergence analysis for a special GPIU(Generalized Parameterized Inexact Uzawa) method with singular preconditioners for solving singular saddle point problems. We next provide a methodology of how to choose nearly quasi-optimal parameters of the special GPIU method. Lastly, numerical experiments are carried out to examine the effectiveness of the special G...
متن کاملAcceleration of One-parameter Relaxation Methods for Singular Saddle Point Problems
In this paper, we first introduce two one-parameter relaxation (OPR) iterative methods for solving singular saddle point problems whose semi-convergence rate can be accelerated by using scaled preconditioners. Next we present formulas for finding their optimal parameters which yield the best semi-convergence rate. Lastly, numerical experiments are provided to examine the efficiency of the OPR m...
متن کامل